Dense packings of congruent circles in a circle
نویسندگان
چکیده
The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the best packings found of up to 65 circles are presented.
منابع مشابه
The Dense Packing of 13 Congruent Circles in a Circle
The densest packings of n congruent circles in a circle are known for n 12 and n = 19. In this paper we exhibit the densest packings of 13 congruent circles in a circle. We show that the optimal con gurations are identical to Kravitz's [11] conjecture. We use a technique developed from a method of Bateman and Erd}os [1] which proved fruitful in investigating the cases n = 12 and 19 by the autho...
متن کاملDense packing of congruent circles in free-form non-convex containers
This work proposes an algorithm for computing dense packings of congruent circles inside general 2D containers. Unlike the previous approaches which accept as containers, only simple, symmetric shapes such as circles, rectangles and triangles, our method works for any container with a general, freeform (spline) boundary. In contrast to most previous approaches which cast the problem into a non-...
متن کاملThe Densest Packing of 13 Congruent Circles in a Circle
The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. In this article we examine the case of 13 congruent circles. We show that the optimal configurations are identical to Kravitz’s conjecture. We use a technique developed from a method of Bateman and Erdős, which proved fruitful in investigating the cases n = 12 and 19. MSC 2000: 52C15
متن کاملLocal-global Principles in Circle Packings
We generalize work of Bourgain-Kontorovich [6] and Zhang [31], proving an almost local-to-global property for the curvatures of certain circle packings, to a large class of Kleinian groups. Specifically, we associate in a natural way an infinite family of integral packings of circles to any Kleinian group A ≤ PSL2(K) satisfying certain conditions, where K is an imaginary quadratic field, and sh...
متن کامل2 1 Ja n 19 97 Circles , Spheres and Drops Packings
We studied the geometrical and topological rules underlying the dispositions and the size distribution of non– overlapping, polydisperse circle–packings. We found that the size distribution of circles that densely cover a plane follows the power law: N(R) ∝ R. We obtained an approximate expression which relates the exponent α to the average coordination number and to the packing strategy. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 181 شماره
صفحات -
تاریخ انتشار 1998